Practical experiments of broadcasting algorithms on a configurable parallel computer
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Image Processing: Practical Algorithms with Experiments
In this paper we design and analyse parallel algorithms with the goal to get exact bounds on their speed-ups on real machines. For this purpose we employ the BSP* model [3] which is an extension of Valiant’s BSP model [13] and rewards blockwise communication. Further we use Valiant’s notion of c-optimality. Intuitively a c-optimal parallel algorithm for p processors tends to speed-up p=c, where...
متن کاملScheduling of parallel programs on configurable multiprocessors by genetic algorithms
The scheduling of programs on parallel hardware is investigated in order to minimize the response time of the resulting system. In particular the scheduling problem considered in this paper includes—next to the search for an optimal mapping of the tasks and their sequence of execution—also the search for an optimal configurationof the parallel hardware. An approach for the simultaneous optimiza...
متن کاملTask Scheduling on Configurable Parallel Systems by Genetic Algorithms
Computing the schedule on a configurable parallel system adds one dimension to the traditional scheduling problem. Besides determining the spatial mapping of tasks to processors and their execution order on the respective processors, additionally the topology of the parallel system has to be configured to best suite the application program. In order to acknowledge the mutual influence between s...
متن کاملPractical Parallel External Memory Algorithms via Simulation of Parallel Algorithms
This thesis introduces PEMS2, an improvement to PEMS (Parallel External Memory System). PEMS executes Bulk-Synchronous Parallel (BSP) algorithms in an External Memory (EM) context, enabling computation with very large data sets which exceed the size of main memory. Many parallel algorithms have been designed and implemented for Bulk-Synchronous Parallel models of computation. Such algorithms ge...
متن کاملExperiments with Dataaow on a General-purpose Parallel Computer
The MIT J-Machine 2], a massively-parallel computer, is an experiment in providing general-purpose mechanisms for communication, synchronization, and naming that will support a wide variety of parallel models of comptuation. We have developed two experimental dataaow programming systems for the J-Machine. For the rst system, we adapted Papadopoulos' explicit token store 12] to implement static ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90192-9